An important issue in dynamic geometry is the reachability problem that\udasks whether there is a continuous path that, from a given starting geometric\udconfiguration, continuously leads to an ending configuration. In this work we report\udon a technique to compute a continuous evaluation path, if one exists, that solves\udthe reachability problem for geometric constructions with one variant parameter.\udThe technique is developed in the framework of a constructive geometric constraintbased\uddynamic geometry system, uses the A∗ algorithm and minimizes the variant\udparameter arc length.
展开▼
